Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering problems
ثبت نشده
چکیده
منابع مشابه
On semidefinite programming bounds for graph bandwidth
We propose two new lower bounds on graph bandwidth and cyclic bandwidth based on semidefinite programming (SDP) relaxations of the quadratic assignment problem. We compare the new bounds with two other SDP bounds in [A. Blum, G. Konjevod, R. Ravi, and S. Vempala, Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems, Theoretical Computer Science, 235(1):25-42, 2000]...
متن کامل22 Spreading Metrics For Vertex Ordering Problems ( Extended
We design approximation algorithms for the vertex ordering problems MINIMUM LINEAR ARRANGEMENT, MINIMUM CONTAINING INTERVAL GRAPH, and MINIMUM STORAGE-TIME PRODUCT, achieving approximation factors of O( √ log n log logn), O( √ logn log logn), and O( √ logT log logT ), respectively, the last running in time polynomial in T (T being the sum of execution times). The technical contribution of our p...
متن کاملSemidefinite Ranking on Graphs
Semidefinite Ranking on Graphs Shankar Vembu, Thomas Gärtner, and Stefan Wrobel 1 Fraunhofer IAIS, Schloß Birlinghoven, 53754 Sankt Augustin, Germany 2 Department of Computer Science III, University of Bonn, Germany {shankar.vembu, thomas.gaertner, stefan.wrobel}@iais.fraunhofer.de We consider the problem of ranking the vertices of an undirected graph given some preference relation. Without inc...
متن کاملSemi-Definite Programming for bandwidth allocation in communication networks
We aim at assigning bandwidth fairly to calls that have minimum bandwidth requirements. Our goal is to provide a general computational tool based on Semi-Definite Programming (SDP). The advantage of our approach is that many appealing complex objective functions related to fairness criteria are special cases of our formalism. Therefore, such optimization problems can be solved in an automatic m...
متن کاملSum of Squares Relaxations for Robust Polynomial Semi-definite Programs
A whole variety of robust analysis and synthesis problems can be formulated as robust Semi-Definite Programs (SDPs), i.e. SDPs with data matrices that are functions of an uncertain parameter which is only known to be contained in some set. We consider uncertainty sets described by general polynomial semi-definite constraints, which allows to represent norm-bounded and structured uncertainties a...
متن کامل